A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem

نویسندگان

  • Peter M. Hahn
  • Yi-Rong Zhu
  • Monique Guignard-Spielberg
  • William L. Hightower
  • Matthew J. Saltzman
چکیده

We apply the level-3 Reformulation Linearization Technique (RLT3) to the Quadratic Assignment Problem (QAP). We then present our experience in calculating lower bounds using an essentially new algorithm, based on this RLT3 formulation. This algorithm is not guaranteed to calculate the RLT3 lower bound exactly, but approximates it very closely and reaches it in some instances. For Nugent problem instances up to size 24, our RLT3-based lower bound calculation solves these problem instances exactly or serves to verify the optimal value. Calculating lower bounds for problems sizes larger than size 25 still presents a challenge due to the large memory needed to implement the RLT3 formulation. Our presentation emphasizes the steps taken to significantly conserve memory by using the numerous problem symmetries in the RLT3 formulation of the QAP. The authors are grateful to management and consulting staff of the San Diego Supercomputing Center for the invaluable computational resources and guidance they provided for this work. We thank Professor Matthew Saltzman of the Mathematics Department at Clemson University for his expert advice on computational optimization matters. Entries of a matrix E of size mxnx…xp, indexed by i,j,…,k, are denoted e ij…k. Conversely, given numbers , one can form a corresponding matrix of appropriate size. Z(P) will denote the optimal value of optimization problem (P).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization Technique

We report on the implementation of a level-3 reformulation linearization technique (RLT-3)-based bound calculation in a branch-and-bound algorithm. The RLT-3-based bound calculation method is not guaranteed to calculate the RLT-3 lower bound exactly, but approximates it very closely and reaches it in some instances. We tested the new branch-andbound solver on six Nugent instances, 15, 18, 20, 2...

متن کامل

Memory-Aware Parallelized RLT3 for solving Quadratic Assignment Problems

We present a coarse-grain (outer-loop) parallel implementation of RLT1/2/3 (Level 1, 2, and 3 Reformulation and Linearization Technique—in that order) bound calculations for the QAP within a branch-and-bound procedure. For a search tree node of size S, each RLT3 and RLT2 bound calculation iteration is parallelized S ways, with each of S processors performing O(S) and O(S) linear assignment prob...

متن کامل

Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique

The Quadratic Assignment Problem, QAP, is a classic combinatorial optimization problem, classified as NP-hard and widely studied. This problem consists in assigning N facilities to N locations obeying the relation of 1 to 1, aiming to minimize costs of the displacement between the facilities. The application of Reformulation and Linearization Technique, RLT, to the QAP leads to a tight linear r...

متن کامل

A level-2 reformulation-linearization technique bound for the quadratic assignment problem

This paper studies polyhedral methods for the quadratic assignment problem. Bounds on the objective value are obtained using mixed 0–1 linear representations that result from a reformulation–linearization technique (rlt). The rlt provides different “levels” of representations that give increasing strength. Prior studies have shown that even the weakest level-1 form yields very tight bounds, whi...

متن کامل

A Tight Lower Bound for the Adjacent Quadratic Assignment Problem

In this paper we address the Adjacent Quadratic Assignment Problem (AQAP) which is a variant of the QAP where the cost coefficient matrix has a particular structure. Motivated by strong lower bounds obtained by applying Reformulation Linearization Technique (RLT) to the classical QAP, we propose two special RLT representations for the problem. The first is based on a “flow” formulation whose li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • INFORMS Journal on Computing

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2012